
<!DOCTYPE HTML>
<html lang="" >
    <head>
        <meta charset="UTF-8">
        <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
        <title>图的存储结构 · GitBook</title>
        <meta http-equiv="X-UA-Compatible" content="IE=edge" />
        <meta name="description" content="">
        <meta name="generator" content="GitBook 3.2.3">
        
        
        
    
    <link rel="stylesheet" href="../gitbook/style.css">

    
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-highlight/website.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-search/search.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-fontsettings/website.css">
                
            
        

    

    
        
    
        
    
        
    
        
    
        
    
        
    

        
    
    
    <meta name="HandheldFriendly" content="true"/>
    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
    <meta name="apple-mobile-web-app-capable" content="yes">
    <meta name="apple-mobile-web-app-status-bar-style" content="black">
    <link rel="apple-touch-icon-precomposed" sizes="152x152" href="../gitbook/images/apple-touch-icon-precomposed-152.png">
    <link rel="shortcut icon" href="../gitbook/images/favicon.ico" type="image/x-icon">

    
    <link rel="next" href="图的遍历.html" />
    
    
    <link rel="prev" href="图.html" />
    

    </head>
    <body>
        
<div class="book">
    <div class="book-summary">
        
            
<div id="book-search-input" role="search">
    <input type="text" placeholder="Type to search" />
</div>

            
                <nav role="navigation">
                


<ul class="summary">
    
    

    

    
        
        
    
        <li class="chapter " data-level="1.1" data-path="../">
            
                <a href="../">
            
                    
                    数据结构（C语言版） 复习总结
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.2" data-path="../chapter1.html">
            
                <a href="../chapter1.html">
            
                    
                    第一章 绪论
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3" data-path="../chapter2/chapter2.html">
            
                <a href="../chapter2/chapter2.html">
            
                    
                    第二章 线性表
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.3.1" data-path="../chapter2/顺序表.html">
            
                <a href="../chapter2/顺序表.html">
            
                    
                    线性表的顺序表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3.2" data-path="../chapter2/链表.html">
            
                <a href="../chapter2/链表.html">
            
                    
                    线性表的链式表示和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.4" data-path="../chapter3/chapter3.html">
            
                <a href="../chapter3/chapter3.html">
            
                    
                    第三章 栈和队列
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.4.1" data-path="../chapter3/栈.html">
            
                <a href="../chapter3/栈.html">
            
                    
                    抽象数据类型栈的定义和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.4.2" data-path="../chapter3/队列.html">
            
                <a href="../chapter3/队列.html">
            
                    
                    抽象数据类型队列的定义和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.5" >
            
                <span>
            
                    
                    第四章 串
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.5.1" data-path="../chapter4/串类型.html">
            
                <a href="../chapter4/串类型.html">
            
                    
                    串类型的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.2" data-path="../chapter4/串的表示和实现.html">
            
                <a href="../chapter4/串的表示和实现.html">
            
                    
                    串的表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.3" data-path="../chapter4/串的模式匹配算法.html">
            
                <a href="../chapter4/串的模式匹配算法.html">
            
                    
                    串的模式匹配算法
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.6" >
            
                <span>
            
                    
                    第五章 数组和广义表
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.6.1" data-path="../chapter5/数组的定义.html">
            
                <a href="../chapter5/数组的定义.html">
            
                    
                    数组的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.2" data-path="../chapter5/矩阵的压缩存储.html">
            
                <a href="../chapter5/矩阵的压缩存储.html">
            
                    
                    矩阵的压缩存储
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.3" data-path="../chapter5/广义表.html">
            
                <a href="../chapter5/广义表.html">
            
                    
                    广义表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7" >
            
                <span>
            
                    
                    第六章 树和二叉树
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.1" data-path="../chapter6/树.html">
            
                <a href="../chapter6/树.html">
            
                    
                    树的定义与基本术语
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.2" data-path="../chapter6/二叉树.html">
            
                <a href="../chapter6/二叉树.html">
            
                    
                    二叉树
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.2.1" data-path="../chapter6/二叉树的二叉链表实现.html">
            
                <a href="../chapter6/二叉树的二叉链表实现.html">
            
                    
                    二叉树的二叉链表实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7.3" data-path="../chapter6/遍历二叉树和线索二叉树.html">
            
                <a href="../chapter6/遍历二叉树和线索二叉树.html">
            
                    
                    遍历二叉树和线索二叉树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.4" data-path="../chapter6/树和森林.html">
            
                <a href="../chapter6/树和森林.html">
            
                    
                    树和森林
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.5" data-path="../chapter6/赫夫曼树.html">
            
                <a href="../chapter6/赫夫曼树.html">
            
                    
                    赫夫曼树
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.8" >
            
                <span>
            
                    
                    第七章 图
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.8.1" data-path="图.html">
            
                <a href="图.html">
            
                    
                    图的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter active" data-level="1.8.2" data-path="图的存储结构.html">
            
                <a href="图的存储结构.html">
            
                    
                    图的存储结构
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.3" data-path="图的遍历.html">
            
                <a href="图的遍历.html">
            
                    
                    图的遍历
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.4" data-path="最小生成树.html">
            
                <a href="最小生成树.html">
            
                    
                    最小生成树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.5" data-path="有向无环图.html">
            
                <a href="有向无环图.html">
            
                    
                    有向无环图的应用
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.9" data-path="../chapter8/查找.html">
            
                <a href="../chapter8/查找.html">
            
                    
                    第八章 查找
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.9.1" data-path="../chapter8/静态查找表.html">
            
                <a href="../chapter8/静态查找表.html">
            
                    
                    静态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.2" data-path="../chapter8/动态查找表.html">
            
                <a href="../chapter8/动态查找表.html">
            
                    
                    动态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.3" data-path="../chapter8/哈希表.html">
            
                <a href="../chapter8/哈希表.html">
            
                    
                    哈希表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.10" data-path="../chapter9/内部排序.html">
            
                <a href="../chapter9/内部排序.html">
            
                    
                    第九章 内部排序
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.10.1" data-path="../chapter9/插入排序.html">
            
                <a href="../chapter9/插入排序.html">
            
                    
                    插入排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.2" data-path="../chapter9/选择排序.html">
            
                <a href="../chapter9/选择排序.html">
            
                    
                    选择排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.3" data-path="../chapter9/快速排序.html">
            
                <a href="../chapter9/快速排序.html">
            
                    
                    快速排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.4" data-path="../chapter9/归并排序和基数排序.html">
            
                <a href="../chapter9/归并排序和基数排序.html">
            
                    
                    归并排序和基数排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.5" data-path="../chapter9/排序方法的比较.html">
            
                <a href="../chapter9/排序方法的比较.html">
            
                    
                    排序方法的比较
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    

    

    <li class="divider"></li>

    <li>
        <a href="https://www.gitbook.com" target="blank" class="gitbook-link">
            Published with GitBook
        </a>
    </li>
</ul>


                </nav>
            
        
    </div>

    <div class="book-body">
        
            <div class="body-inner">
                
                    

<div class="book-header" role="navigation">
    

    <!-- Title -->
    <h1>
        <i class="fa fa-circle-o-notch fa-spin"></i>
        <a href=".." >图的存储结构</a>
    </h1>
</div>




                    <div class="page-wrapper" tabindex="-1" role="main">
                        <div class="page-inner">
                            
<div id="book-search-results">
    <div class="search-noresults">
    
                                <section class="normal markdown-section">
                                
                                <h2 id="&#x56FE;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;">&#x56FE;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;</h2>
<p>&#x5E38;&#x7528;&#x7684;&#x6709;&#x90BB;&#x63A5;&#x8868;&#x3001;&#x90BB;&#x63A5;&#x591A;&#x91CD;&#x8868;&#x548C;&#x5341;&#x5B57;&#x94FE;&#x8868;&#x3002;</p>
<h3 id="&#x6570;&#x7EC4;&#x8868;&#x793A;&#x6CD5;&#xFF08;&#x90BB;&#x63A5;&#x77E9;&#x9635;&#xFF09;">&#x6570;&#x7EC4;&#x8868;&#x793A;&#x6CD5;&#xFF08;&#x90BB;&#x63A5;&#x77E9;&#x9635;&#xFF09;</h3>
<p>&#x7528;&#x4E24;&#x4E2A;&#x6570;&#x7EC4;&#x5206;&#x522B;&#x5B58;&#x50A8;&#x6570;&#x636E;&#x5143;&#x7D20;&#xFF08;&#x9876;&#x70B9;&#xFF09;&#x7684;&#x4FE1;&#x606F;&#x548C;&#x6570;&#x636E;&#x5143;&#x7D20;&#x4E4B;&#x95F4;&#x7684;&#x5173;&#x7CFB;&#x3002;</p>
<pre><code class="lang-C"><span class="hljs-meta">#<span class="hljs-meta-keyword">define</span> MAXSIZE 10</span>

<span class="hljs-comment">/**
 * &#x90BB;&#x63A5;&#x77E9;&#x9635;&#x7684;&#x7B80;&#x5355;&#x5316;&#x8868;&#x793A;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span>
{
    <span class="hljs-keyword">int</span> vexs[MAXSIZE]; <span class="hljs-comment">// &#x5B58;&#x653E;&#x9876;&#x70B9;&#x4FE1;&#x606F;</span>
    <span class="hljs-keyword">int</span> edges[MAXSIZE][MAXSIZE]; <span class="hljs-comment">// &#x90BB;&#x63A5;&#x77E9;&#x9635;&#xFF0C;&#x6709;&#x8FB9;&#x65F6;&#x4E3A; 1</span>
    <span class="hljs-keyword">int</span> V, E; <span class="hljs-comment">// &#x5206;&#x522B;&#x8868;&#x793A;&#x9876;&#x70B9;&#x6570;&#x4E0E;&#x8FB9;&#x6570;</span>
}Graph;
</code></pre>
<p>&#x4EE5;&#x4E8C;&#x7EF4;&#x6570;&#x7EC4;&#x8868;&#x793A;&#x6709; <em>n</em> &#x4E2A;&#x9876;&#x70B9;&#x7684;&#x56FE;&#x65F6;&#xFF0C;&#x9700;&#x5B58;&#x653E; <em>n</em> &#x4E2A;&#x9876;&#x70B9;&#x4FE1;&#x606F;&#x548C; <em>n<sup>2</sup></em> &#x4E2A;&#x5F27;&#x7684;&#x5B58;&#x50A8;&#x91CF;&#x3002;&#x8003;&#x8651;&#x65E0;&#x5411;&#x56FE;&#x7684;&#x90BB;&#x63A5;&#x77E9;&#x9635;&#x7684;&#x5BF9;&#x79F0;&#x6027;&#xFF0C;&#x5219;&#x53EF;&#x91C7;&#x7528;&#x538B;&#x7F29;&#x77E9;&#x9635;&#x5B58;&#x50A8;&#x7684;&#x65B9;&#x5F0F;&#x53EA;&#x5B58;&#x5165;&#x77E9;&#x9635;&#x7684;&#x4E0A;&#xFF08;&#x4E0B;&#xFF09;&#x4E09;&#x89D2;&#x5143;&#x7D20;&#x3002;</p>
<blockquote>
<p>&#x5BF9;&#x4E8E;&#x65E0;&#x5411;&#x56FE;&#xFF0C;&#x7B2C; <em>i</em> &#x884C;&#x5143;&#x7D20;&#x4E4B;&#x548C;&#x4E3A;&#x7B2C; <em>i</em> &#x4E2A;&#x9876;&#x70B9;&#x7684;&#x5EA6;&#x6570;&#x3002;&#x5BF9;&#x4E8E;&#x6709;&#x5411;&#x56FE;&#xFF0C;&#x7B2C; <em>i</em> &#x884C;&#x5143;&#x7D20;&#x4E4B;&#x548C;&#x4E3A;&#x7B2C; <em>i</em> &#x4E2A;&#x9876;&#x70B9;&#x7684;&#x51FA;&#x5EA6;&#xFF0C;&#x7B2C; <em>i</em> &#x5217;&#x5143;&#x7D20;&#x4E4B;&#x548C;&#x4E3A;&#x7B2C; <em>i</em> &#x4E2A;&#x9876;&#x70B9;&#x7684;&#x5165;&#x6570;&#x3002;</p>
</blockquote>
<h3 id="&#x90BB;&#x63A5;&#x8868;">&#x90BB;&#x63A5;&#x8868;</h3>
<p><strong>&#x90BB;&#x63A5;&#x8868;</strong>&#x662F;&#x56FE;&#x7684;&#x4E00;&#x79CD;&#x94FE;&#x5F0F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#x3002;&#x5728;&#x90BB;&#x63A5;&#x8868;&#x4E2D;&#xFF0C;&#x4E3A;&#x56FE;&#x4E2D;&#x6BCF;&#x4E2A;&#x9876;&#x70B9;&#x5EFA;&#x7ACB;&#x4E00;&#x4E2A;&#x5355;&#x94FE;&#x8868;&#xFF0C;&#x7B2C; <em>i</em> &#x4E2A;&#x5355;&#x94FE;&#x8868;&#x4E2D;&#x7684;&#x7ED3;&#x70B9;&#x8868;&#x793A;&#x4F9D;&#x9644;&#x4E8E;&#x9876;&#x70B9; <em>v<sub>i</sub></em> &#x7684;&#x8FB9;&#xFF08;&#x6709;&#x5411;&#x56FE;&#x4E2D;&#x6307;&#x4EE5; <em>v<sub>i</sub></em> &#x4E3A;&#x5C3E;&#x7684;&#x5F27;&#xFF09;&#x3002;</p>
<p>&#x6BCF;&#x4E2A;&#x7ED3;&#x70B9;&#x7531; 3 &#x4E2A;&#x57DF;&#x7EC4;&#x6210;&#xFF0C;&#x90BB;&#x63A5;&#x70B9;&#x57DF; <code>adjvex</code> &#x6307;&#x793A;&#x4E0E;&#x9876;&#x70B9; <em>v<sub>i</sub></em> &#x90BB;&#x63A5;&#x7684;&#x70B9;&#x5728;&#x8868;&#x5934;&#x6570;&#x7EC4;&#x4E2D;&#x7684;&#x4F4D;&#x7F6E;&#xFF0C;&#x94FE;&#x57DF; <code>nextarc</code> &#x6307;&#x793A;&#x4E0B;&#x4E00;&#x6761;&#x8FB9;&#x6216;&#x5F27;&#x7684;&#x7ED3;&#x70B9;&#xFF1B;&#x6570;&#x636E;&#x57DF; <code>info</code> &#x5B58;&#x50A8;&#x548C;&#x8FB9;&#x6216;&#x5F27;&#x76F8;&#x5173;&#x4FE1;&#x606F;&#xFF08;&#x6743;&#x503C;&#x7B49;&#xFF09;&#x3002;</p>
<p>&#x5728;&#x8868;&#x5934;&#x7ED3;&#x70B9;&#x4E2D;&#xFF0C;&#x8BBE;&#x6709;&#x94FE;&#x57DF; <code>firstarc</code> &#x6307;&#x5411;&#x94FE;&#x8868;&#x4E2D;&#x7B2C;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#xFF0C;&#x8BBE;&#x6709;&#x5B58;&#x50A8;&#x5173;&#x4E8E;&#x9876;&#x70B9; <em>v<sub>i</sub></em> &#x7684;&#x76F8;&#x5173;&#x4FE1;&#x606F;&#x7684;&#x6570;&#x636E;&#x57DF; <code>data</code>&#x3002;&#x8868;&#x5934;&#x7ED3;&#x70B9;&#x901A;&#x5E38;&#x4EE5;&#x987A;&#x5E8F;&#x7ED3;&#x6784;&#x7684;&#x5F62;&#x5F0F;&#x5B58;&#x50A8;&#xFF0C;&#x4EE5;&#x4FBF;&#x968F;&#x673A;&#x8BBF;&#x95EE;&#x4EFB;&#x610F;&#x9876;&#x70B9;&#x7684;&#x94FE;&#x8868;&#x3002;</p>
<pre><code class="lang-C"><span class="hljs-meta">#<span class="hljs-meta-keyword">define</span> MAX_VERTEX_NUM 20 <span class="hljs-comment">// &#x6700;&#x5927;&#x9876;&#x70B9;&#x4E2A;&#x6570;</span></span>

<span class="hljs-comment">/**
 * &#x8868;&#x793A;&#x8FB9;&#x7684;&#x7ED3;&#x70B9;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> ArcNode
{
    <span class="hljs-keyword">int</span> adjvex; <span class="hljs-comment">// &#x8BE5;&#x5F27;&#x6240;&#x6307;&#x5411;&#x7684;&#x9876;&#x70B9;&#x7684;&#x4F4D;&#x7F6E;</span>
    <span class="hljs-keyword">struct</span> ArcNode *nextarc; <span class="hljs-comment">// &#x6307;&#x5411;&#x4E0B;&#x4E00;&#x6761;&#x8FB9;&#x6216;&#x5F27;&#x7684;&#x6307;&#x9488;</span>
    InfoType *info; <span class="hljs-comment">// &#x8BE5;&#x5F27;&#x76F8;&#x5173;&#x4FE1;&#x606F;&#x7684;&#x6307;&#x9488;</span>
} ArcNode;

<span class="hljs-comment">/**
 * &#x9876;&#x70B9;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> VNode
{   VertexType data; <span class="hljs-comment">// &#x9876;&#x70B9;&#x4FE1;&#x606F;</span>
    ArcNode *firstarc; <span class="hljs-comment">// &#x6307;&#x5411;&#x7B2C;&#x4E00;&#x6761;&#x4F9D;&#x9644;&#x8BE5;&#x9876;&#x70B9;&#x7684;&#x5F27;&#x7684;&#x6307;&#x9488;</span>
}Vnode, AdjList[MAX_VERTEX_NUM];

<span class="hljs-comment">/**
 * &#x90BB;&#x63A5;&#x8868;&#x8868;&#x793A;&#x7684;&#x56FE;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span>
{
    AdjList vertices; <span class="hljs-comment">// &#x90BB;&#x63A5;&#x8868;</span>
    <span class="hljs-keyword">int</span> vexnum, arcnum; <span class="hljs-comment">// &#x56FE;&#x7684;&#x5F53;&#x524D;&#x9876;&#x70B9;&#x6570;&#x548C;&#x5F27;(&#x8FB9;)&#x6570;     int kind; // &#x56FE;&#x7684;&#x79CD;&#x7C7B;</span>
}ALGraph;
</code></pre>
<p>&#x5728;&#x65E0;&#x5411;&#x56FE;&#x7684;&#x90BB;&#x63A5;&#x8868;&#x4E2D;&#xFF0C;&#x9876;&#x70B9; <em>v<sub>i</sub></em> &#x7684;&#x5EA6;&#x4E3A;&#x7B2C; <em>i</em> &#x4E2A;&#x94FE;&#x8868;&#x4E2D;&#x7684;&#x7ED3;&#x70B9;&#x6570;&#xFF1B;&#x6709;&#x5411;&#x56FE;&#x4E2D;&#xFF0C;&#x9876;&#x70B9; <em>v<sub>i</sub></em> &#x7684;&#x51FA;&#x5EA6;&#x4E3A;&#x7B2C; <em>i</em> &#x4E2A;&#x94FE;&#x8868;&#x4E2D;&#x7684;&#x7ED3;&#x70B9;&#x4E2A;&#x6570;&#xFF0C;&#x5165;&#x5EA6;&#x4E3A;&#x5168;&#x90E8;&#x94FE;&#x8868;&#x4E2D;&#x90BB;&#x63A5;&#x70B9;&#x57DF;&#x503C;&#x662F; <em>i</em> &#x7684;&#x7ED3;&#x70B9;&#x4E2A;&#x6570;&#x3002;</p>
<blockquote>
<p>&#x5728;&#x65E0;&#x5411;&#x56FE;&#x4E2D;&#xFF0C;&#x6709; <em>n</em> &#x4E2A;&#x9876;&#x70B9;&#xFF0C;<em>e</em> &#x6761;&#x8FB9;&#xFF0C;&#x5219;&#x5B83;&#x7684;&#x90BB;&#x63A5;&#x8868;&#x9700;&#x8981; <em>n</em> &#x4E2A;&#x5934;&#x7ED3;&#x70B9;&#x4E0E; <em>2e</em> &#x4E2A;&#x8868;&#x7ED3;&#x70B9;&#x3002;</p>
</blockquote>
<h3 id="&#x5341;&#x5B57;&#x94FE;&#x8868;">&#x5341;&#x5B57;&#x94FE;&#x8868;</h3>
<p>&#x53EF;&#x4EE5;&#x770B;&#x6210;&#x662F;&#x5C06;&#x6709;&#x5411;&#x56FE;&#x7684;&#x90BB;&#x63A5;&#x8868;&#x548C;&#x9006;&#x90BB;&#x63A5;&#x8868;&#x7ED3;&#x5408;&#x8D77;&#x6765;&#x5F97;&#x5230;&#x7684;&#x4E00;&#x79CD;&#x94FE;&#x8868;&#x3002;&#x5728;&#x5341;&#x5B57;&#x94FE;&#x8868;&#x4E2D;&#xFF0C;&#x5BF9;&#x5E94;&#x4E8E;&#x6709;&#x5411;&#x56FE;&#x4E2D;&#x7684;&#x6BCF;&#x4E00;&#x6761;&#x5F27;&#x90FD;&#x6709;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#xFF0C;&#x5BF9;&#x5E94;&#x4E8E;&#x6BCF;&#x4E2A;&#x9876;&#x70B9;&#x4E5F;&#x90FD;&#x6709;&#x4E00;&#x4E2A;&#x9876;&#x70B9;&#x3002;</p>
<p>&#x5728;&#x5F27;&#x7ED3;&#x70B9;&#x4E2D;&#x6709; 5 &#x4E2A;&#x57DF;&#xFF1A;&#x5176;&#x4E2D;&#x5C3E;&#x57DF; <code>tailtex</code> &#x548C;&#x5934;&#x57DF; <code>headtex</code> &#x5206;&#x522B;&#x6307;&#x793A;&#x5F27;&#x5C3E;&#x548C;&#x5F27;&#x5934;&#x7684;&#x4F4D;&#x7F6E;&#xFF0C;&#x94FE;&#x57DF; <code>hlink</code> &#x6307;&#x5411;&#x5F27;&#x5934;&#x76F8;&#x540C;&#x7684;&#x4E0B;&#x4E00;&#x6761;&#x5F27;&#xFF0C;&#x800C;&#x94FE;&#x57DF; <code>tlink</code> &#x6307;&#x5411;&#x5F27;&#x5C3E;&#x76F8;&#x540C;&#x7684;&#x4E0B;&#x4E00;&#x6761;&#x5F27;&#xFF0C;<code>info</code> &#x57DF;&#x6307;&#x5411;&#x8BE5;&#x5F27;&#x7684;&#x76F8;&#x5173;&#x4FE1;&#x606F;&#x3002;&#x5F27;&#x5934;&#x76F8;&#x540C;&#x7684;&#x5F27;&#x5728;&#x540C;&#x4E00;&#x94FE;&#x8868;&#x4E0A;&#xFF0C;&#x5F27;&#x5C3E;&#x76F8;&#x540C;&#x7684;&#x5F27;&#x4E5F;&#x5728;&#x540C;&#x4E00;&#x94FE;&#x8868;&#x4E0A;&#x3002;</p>
<p>&#x5934;&#x7ED3;&#x70B9;&#x5373;&#x4E3A;&#x9876;&#x70B9;&#x7ED3;&#x70B9;&#xFF0C;&#x5B83;&#x7531; 3 &#x4E2A;&#x57DF;&#x7EC4;&#x6210;&#xFF1A;<code>data</code> &#x57DF;&#x5B58;&#x50A8;&#x548C;&#x9876;&#x70B9;&#x76F8;&#x5173;&#x7684;&#x4FE1;&#x606F;&#xFF0C;<code>firstin</code> &#x548C; <code>firstout</code> &#x4E3A;&#x4E24;&#x4E2A;&#x94FE;&#x57DF;&#xFF0C;&#x5206;&#x522B;&#x6307;&#x5411;&#x4EE5;&#x8BE5;&#x7ED3;&#x70B9;&#x4E3A;&#x5F27;&#x5934;&#x6216;&#x5F27;&#x5C3E;&#x7684;&#x7B2C;&#x4E00;&#x4E2A;&#x5F27;&#x7ED3;&#x70B9;&#x3002;</p>
<pre><code class="lang-C"><span class="hljs-meta">#<span class="hljs-meta-keyword">define</span> MAX_VERTEX_NUM 20 <span class="hljs-comment">// &#x6700;&#x5927;&#x9876;&#x70B9;&#x6570;</span></span>

<span class="hljs-comment">/**
 * &#x5F27;&#x7ED3;&#x70B9;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> ArcBox
{ 
    <span class="hljs-keyword">int</span> tailvex, headvex; <span class="hljs-comment">// &#x8BE5;&#x5F27;&#x7684;&#x5C3E;&#x548C;&#x5934;&#x9876;&#x70B9;&#x7684;&#x4F4D;&#x7F6E;</span>
    <span class="hljs-keyword">struct</span> ArcBox *hlink, *tlink; <span class="hljs-comment">// &#x5206;&#x522B;&#x4E3A;&#x5F27;&#x5934;&#x76F8;&#x540C;&#x548C;&#x5F27;&#x5C3E;&#x76F8;&#x540C;&#x7684;&#x5F27;&#x7684;&#x6307;&#x9488;&#x57DF;</span>
    InfoType *info; <span class="hljs-comment">// &#x8BE5;&#x5F27;&#x76F8;&#x5173;&#x4FE1;&#x606F;&#x7684;&#x6307;&#x9488;</span>
}ArcBox;

<span class="hljs-comment">/**
 * &#x9876;&#x70B9;&#x7ED3;&#x70B9;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> VexNode
{
    VertexType data;
    ArcBox *firstin, *firstout; <span class="hljs-comment">// &#x5206;&#x522B;&#x6307;&#x5411;&#x8BE5;&#x9876;&#x70B9;&#x7B2C;&#x4E00;&#x6761;&#x5165;&#x5F27;&#x548C;&#x51FA;&#x5F27;</span>
}VexNode;

<span class="hljs-comment">/**
 * &#x6709;&#x5411;&#x56FE;&#x7684;&#x5341;&#x5B57;&#x94FE;&#x8868;&#x8868;&#x793A;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span>
{
    VexNode xlist[MAX_VERTEX_NUM]; <span class="hljs-comment">// &#x8868;&#x5934;&#x5411;&#x91CF;</span>
    <span class="hljs-keyword">int</span> vexnum, arcnum; <span class="hljs-comment">// &#x6709;&#x5411;&#x56FE;&#x7684;&#x5F53;&#x524D;&#x9876;&#x70B9;&#x6570;&#x548C;&#x5F27;&#x6570;</span>
}OLGraph;
</code></pre>

                                
                                </section>
                            
    </div>
    <div class="search-results">
        <div class="has-results">
            
            <h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
            <ul class="search-results-list"></ul>
            
        </div>
        <div class="no-results">
            
            <h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
            
        </div>
    </div>
</div>

                        </div>
                    </div>
                
            </div>

            
                
                <a href="图.html" class="navigation navigation-prev " aria-label="Previous page: 图的定义">
                    <i class="fa fa-angle-left"></i>
                </a>
                
                
                <a href="图的遍历.html" class="navigation navigation-next " aria-label="Next page: 图的遍历">
                    <i class="fa fa-angle-right"></i>
                </a>
                
            
        
    </div>

    <script>
        var gitbook = gitbook || [];
        gitbook.push(function() {
            gitbook.page.hasChanged({"page":{"title":"图的存储结构","level":"1.8.2","depth":2,"next":{"title":"图的遍历","level":"1.8.3","depth":2,"path":"chapter7/图的遍历.md","ref":"chapter7/图的遍历.md","articles":[]},"previous":{"title":"图的定义","level":"1.8.1","depth":2,"path":"chapter7/图.md","ref":"chapter7/图.md","articles":[]},"dir":"ltr"},"config":{"gitbook":"*","theme":"default","variables":{},"plugins":[],"pluginsConfig":{"highlight":{},"search":{},"lunr":{"maxIndexSize":1000000,"ignoreSpecialCharacters":false},"sharing":{"facebook":true,"twitter":true,"google":false,"weibo":false,"instapaper":false,"vk":false,"all":["facebook","google","twitter","weibo","instapaper"]},"fontsettings":{"theme":"white","family":"sans","size":2},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"}},"file":{"path":"chapter7/图的存储结构.md","mtime":"2018-08-24T09:38:12.763Z","type":"markdown"},"gitbook":{"version":"3.2.3","time":"2018-09-02T10:05:33.540Z"},"basePath":"..","book":{"language":""}});
        });
    </script>
</div>

        
    <script src="../gitbook/gitbook.js"></script>
    <script src="../gitbook/theme.js"></script>
    
        
        <script src="../gitbook/gitbook-plugin-search/search-engine.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-search/search.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/lunr.min.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/search-lunr.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-sharing/buttons.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
        
    

    </body>
</html>

